Solving the Parallel Drone Scheduling Traveling Salesman Problem via Constraint Programming

Drones are currently seen as a viable way of improving the distribution parcels in urban and rural environments, while working coordination with traditional vehicles, such trucks. In this paper, we consider parallel drone scheduling traveling salesman problem, where set customers requiring delivery is split between truck fleet drones, aim minimizing total time required to serve all customers. We propose constraint programming model for discuss its implementation present results an experimental program on instances previously cited literature validate exact heuristic algorithms. were able decrease cost (the customers) some and, first time, provide demonstrated optimal solution considered. These show that can be very effective tool attacking optimization problems components, one discussed.